Two results for prioritized logic programming
نویسنده
چکیده
Prioritized default reasoning has illustrated its rich expressiveness and flexibility in knowledge representation and reasoning. However, many important aspects of prioritized default reasoning have yet to be thoroughly explored. In this paper, we investigate two properties of prioritized logic programs in the context of answer set semantics. Specifically, we reveal a close relationship between mutual defeasibility and uniqueness of the answer set for a prioritized logic program. We then explore how the splitting technique for extended logic programs can be extended to prioritized logic programs. We prove splitting theorems that can be used to simplify the evaluation of a prioritized logic program under certain conditions.
منابع مشابه
Properties of Prioritized Logic
Prioritized logic programming has illustrated its rich expres-siveness and exibility in knowledge representation and reasoning. However , some important aspects of prioritized logic programs have yet to be thoroughly explored. In this paper, we investigate several properties of prioritized logic programs in the context of answer set semantics. Specifically , we propose a characterization on the...
متن کاملRepresenting Priorities in Logic Programs
Reasoning with priorities is a central topic in knowledge representation. A number of techniques for prioritized reasoning have been developed in the eld of AI, but existing logic programming lacks the mechanism of explicit representation of priorities in a program. In this paper, we introduce a framework for representing priorities in logic programming. Prioritized logic programming represents...
متن کاملPrioritized logic programming and its application to commonsense reasoning
Representing and reasoning with priorities are important in commonsense reasoning. This paper introduces a framework of prioritized logic programming (PLP), which has a mechanism of explicit representation of priority information in a program. When a program contains incomplete or indefinite information, PLP is useful for specifying preference to reduce non-determinism in logic programming. Mor...
متن کاملOn the Semantics of Logic Programs with Preferences
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation for prioritized logic programs, is inspired by the semantics of Prioritized Logic Programming and enriched with the use of structural information of preference of Answer Set Optimization Programming. Specifically, the an...
متن کاملDisambiguation by Prioritized Circumscription
This paper presents a method of resolving ambiguity by using a variant of circumscription, prioritized circumscription. In a disambiguation task, human seems to use various preferences which have various strength. In prioritized circumscription, we can express these preferences as defeasible constraints with various strength and we infer the most preferable logical models which satisfy stronger...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- TPLP
دوره 3 شماره
صفحات -
تاریخ انتشار 2003